Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics

نویسندگان

  • Evgenia Christoforou
  • Antonio Fernández
  • Chryssis Georgiou
  • Miguel A. Mosteiro
  • Ángel Sánchez
چکیده

We consider Internet-based Master-Worker computations, like SETI@home, where a master process sends tasks, across the Internet, to worker processes; workers execute and report back some result. However, these workers are not trustworthy and it might be at their best interest to report incorrect results. In such master-worker computations, the behavior and the best interest of the workers might change over time. We model such computations using evolutionary dynamics and we study the conditions under which the master can reliably obtain tasks results. In particular, we develop and analyze an algorithmic mechanism based on reinforcement learning to provide workers with the necessary incentives to eventually become truthful. Our analysis identifies the conditions under which truthful behavior can be ensured, and bounds the expected convergence time to that behavior. The analysis is complemented with simulations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applying the dynamics of evolution to achieve reliability in master-worker computing

We consider Internet-based Master-Worker task computations, like SETI@home, where a master process sends tasks, across the Internet, to worker processes; workers execute, and report back some result. However, these workers are not trustworthy and it might be at their best interest to report incorrect results. In such master-worker computations, the behavior and the best interest of the workers ...

متن کامل

Reputation-Based Mechanisms for Evolutionary Master-Worker Computing

Abstract. We consider Internet-based Master-Worker task computing systems, such as SETI@home, where a master sends tasks to potentially unreliable workers, and the workers execute and report back the result. We model such computations using evolutionary dynamics and consider three type of workers: altruistic, malicious and rational. Altruistic workers always compute and return the correct resul...

متن کامل

Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm

This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and bound algorithm on a distributed computing system. The application program, which this paper addresses, solves the BMI Eigenvalue Problem, which is an optimization problem to minimize the greatest eigenvalue of a bilin...

متن کامل

A Parallel Branch and Bound Algorithm for Solving Large Scale Integer Programming Problems

Branch and Bound technique is commonly used for intelligent search in finding a set of integer solutions within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. While the master-worker paradigm is successfully used in many parallel applications as a common framework to i...

متن کامل

Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion

In this work, using a game-theoretic approach, cost-sensitive mechanisms that lead to reliable Internet-based computing are designed. In particular, we consider Internet-based master-worker computations, where a master processor assigns, across the Internet, a computational task to a set of potentially untrusted worker processors and collects their responses. Workers may collude in order to inc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012